Fast graph operations in quantum computation
نویسندگان
چکیده
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in the reverse direction to yield a graph data structure which allows for more efficient manipulation and comparison of graphs than any possible classical structure. We introduce efficient algorithms for many transformation and comparison operations on graphs represented as graph states, and prove that no classical data structure can have similar performance for the full set of operations studied.
منابع مشابه
Three Graceful Operations
A graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ E(G)} consists of n integers. Inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of G and K2 , and the disjoint union of G a...
متن کاملOne-way Quantum Computation A tutorial introduction
The circuit model of quantum computation [1, 2, 3] has been a powerful tool for the development of quantum computation, acting as both a framework for theoretical investigations and as a guide for experiment. In the circuit model (also called the network model), unitary operations are represented by a network of elementary quantum gates, for example the CNOT gate and single-qubit operations. Ma...
متن کاملLimitations on the simulation of non-sparse Hamiltonians
The problem of simulating sparse Hamiltonians on quantum computers is well-studied. The evolution of a sparse Hamiltonian H for time t can be simulated using O(‖Ht‖) operations, which is essentially optimal due to a no–fast-forwarding theorem. Here, we consider simulation of dense Hamiltonians. On the positive side, we show that some dense Hamiltonians can be simulated efficiently, such as thos...
متن کاملComputation by measurements: A unifying picture
The ability to perform a universal set of quantum operations based solely on static resources and measurements presents us with a striking viewpoint for thinking about quantum computation and its powers. We consider the two major models for doing quantum computation by measurements that have hitherto appeared in the literature and show that they are conceptually closely related by demonstrating...
متن کاملTwisted graph states for ancilla-driven quantum computation
We introduce a new paradigm for quantum computing called Ancilla-Driven Quantum Computation (ADQC) which combines aspects of the quantum circuit [1] and the one-way model [2] to overcome challenging issues in building large-scale quantum computers. Instead of directly manipulating each qubit to perform universal quantum logic gates or measurements, ADQC uses a fixed two-qubit interaction to cou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1510.03742 شماره
صفحات -
تاریخ انتشار 2015